Big O Notation for with n^3 Nested For loops?

If you only consider the inner loop, it gets executed N^3 times the outer loop makes the inner one execute N times, so total complexity = N * N^3 = N^4.

The outer loop has O(2n) operations. The inner loop has O(n^3) operations. Together, the program has O(n)*O(n^3) = O(N^4).

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.